Data structures for optimizing linear spline approximations
نویسندگان
چکیده
منابع مشابه
Data structures for optimizing linear spline approximations
We describe the algorithms and data structures used for optimizing linear spline approximations of bivariate functions. Our method creates a random initial triangulation of a given data set and then employs a simulated annealing algorithm to improve this initial approximation. In every iteration step, the current approximation is changed in a random but local way, and the distance measure betwe...
متن کاملOn Simulated Annealing and the Construction of Linear Spline Approximations for Scattered Data
We describe a method to create optimal linear spline approximations to arbitrary functions of one or two variables, given as scattered data without known connectivity. We start with an initial approximation consisting of a fixed number of vertices and improve this approximation by choosing different vertices, governed by a simulated annealing algorithm. In the case of one variable, the approxim...
متن کاملOptimizing Spatial Data Structures For Static Data
Abstract. During the last decade various spatial data structures have been designed and compared against each other, all of them re ecting a dynamic situation with ongoing object insertion and deletion processes. Assuming the frequently occurring situation where the data is known in beforehand and using as performance measure the expected number of data bucket accesses needed to perform a windo...
متن کاملHierarchical Spline Approximations
1 Center for Image Processing and Integrated Computing (CIPIC), Department of Computer Science, University of California, Davis, CA 95616-8562, U.S.A.; e-mail: {wiley, hamann, joy}@cs.ucdavis.edu 2 University of Kaiserslautern, Fachbereich Informatik, P.O. Box 3049, D-67653 Kaiserslautern, Germany; e-mail: {bertram, scheuer}@informatik.uni-kl.de 3 Pixar Feature Division, Pixar Animation Studios...
متن کاملOn Spline Approximations for Bayesian Computations
Probabilistic reasoning su ers from NP-hard implementations. In particular, the amount of probabilistic information necessary to the computations is often overwhelming. For example, the size of conditional probability tables in Bayesian networks has long been a limiting factor in the general use of these networks. We present a new approach for manipulating the probabilistic information given. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Graphics
سال: 2000
ISSN: 0097-8493
DOI: 10.1016/s0097-8493(00)00031-5